Flow Analysis: Games and Nets

نویسندگان

  • Chris Hankin
  • Rajagopal Nagarajan
  • Prahladavaradan Sampath
چکیده

This paper presents a graph-based formulation of controlflow analysis using results from game semantics and proof-nets. Controlflow analysis aims to give a conservative prediction of the flow of control in a program. In our analysis, terms are represented by proof-nets and control-flow analysis amounts to the analysis of computation paths in the proof-net. We focus on a context free analysis known in the literature as 0-CFA, and develop an algorithm for the analysis. The algorithm for 0CFA performs dynamic transitive closure of a graph that is based on the judgement associated with the proof-net. Correctness of the algorithm relies on the correspondence between proof-nets and certain kinds of strategies in game semantics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)

A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...

متن کامل

A tractable and expressive class of marginal contribution nets and its applications

Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficiently compute solution concepts assuming such representations. Marginal contribution nets (MC-nets), introduced by Ieong and Shoham, are one of the simplest and most influential representation schemes for coalitional gam...

متن کامل

Coalitional Games via Network Flows

We introduce a new representation scheme for coalitional games, called coalition-flow networks (CF-NETs), where the formation of effective coalitions in a task-based setting is reduced to the problem of directing flow through a network. We show that our representation is intuitive, fully expressive, and captures certain patterns in a significantly more concise manner compared to the conventiona...

متن کامل

Comparing flow experience of medical students in cognitive, behavioral, and social educational games: A quasi-experimental study

Background & Objective: This study contributed to the current body of literature on educational games by comparing medical students’ flow experience in three types of educational games developed based on three learning theories: behavioral, cognitive, and social. Materials & Methods: A quasi-experimental repeated measure design was employed. A total of 39 second-year medical students played th...

متن کامل

Hedonic coalition nets

In hedonic games, players have the opportunity to form coalitions, and have preferences over the coalitions they might join. Such games can be used to model a variety of settings ranging from multi-agent coordination to group formation in social networks. However, the practical application of hedonic games is hindered by the fact that the naive representation for such games is exponential in th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002